Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.00 vteřin. 
Heuristic algorithms in optimization
Šandera, Čeněk ; Popela, Pavel (oponent) ; Roupec, Jan (vedoucí práce)
The thesis deals with stochastic programming and determining probability distributions which cause extreme optimal values (maximal or minimal) of an objective function. The probability distribution is determined by heuristic method, especially by genetic algorithms, where whole population approximates desired distribution. The first parts of the thesis describe mathematical and stochastic programming in general and also there are described various heuristic methods with emphasis on genetic algorithms. The goal of the diploma thesis is to create a program which tests the algorithm on linear and quadratic stochastic models.
Heuristic algorithms in optimization
Šandera, Čeněk ; Popela, Pavel (oponent) ; Roupec, Jan (vedoucí práce)
The thesis deals with stochastic programming and determining probability distributions which cause extreme optimal values (maximal or minimal) of an objective function. The probability distribution is determined by heuristic method, especially by genetic algorithms, where whole population approximates desired distribution. The first parts of the thesis describe mathematical and stochastic programming in general and also there are described various heuristic methods with emphasis on genetic algorithms. The goal of the diploma thesis is to create a program which tests the algorithm on linear and quadratic stochastic models.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.